Pseudofractals and box counting algorithm

نویسنده

  • Andrzej Z. Górski
چکیده

We show that for sets with the Hausdorff–Besicovitch dimension equal zero the box counting algorithm commonly used to calculate Renyi exponents (dq) can exhibit perfect scaling suggesting non zero dq’s. Properties of these pathological sets (pseudofractals) are investigated. Numerical, as well as analytical estimates for dq’s are obtained. A simple indicator is given to distinguish pseudofractals and fractals in practical applications of the box counting method. Histograms made of pseudofractal sets are shown to have Pareto tails.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Dynamic Box-Counting Algorithm

An optimal box-counting algorithm for estimating the fractal dimension of a nonempty set which changes over time is given. This nonstationary environment is characterized by the insertion of new points into the set and in many cases the deletion of some existing points from the set. In this setting, the issue at hand is to update the box-counting result at appropriate time intervals with low co...

متن کامل

A Variation of the Box-Counting Algorithm Applied to Colour Images

The box counting method for fractal dimension estimation had not been applied to large or colour images thus far due to the processing time required. In this letter we present a fast, easy to implement and very easily expandable to any number of dimensions variation, the box merging method. It is applied here in RGB images which are considered as sets in 5-D space.

متن کامل

Shape analysis of MR brain images based on the fractal dimension

This paper presents some results concerning the application of the fractal approach to the analysis of shape of white brain matter in the magnetic-resonance (MR) images. The fractal dimension of white brain matter was calculated using the box-counting algorithm.

متن کامل

A Comparative Analysis on Estimation of Fractal Dimension of Gray Scale Images

Fractal Dimension (FD) is an essential feature of fractal geometry that characterizes the surface roughness of complex or irritated objects. Though, fractal dimension gradually established its importance in the area of image processing by means of image segmentation, Pattern recognition, texture and medical signal analysis and many more. A number of algorithms for estimation of fractal dimensio...

متن کامل

Computing the Fractal Dimension of Software Networks

Given a large software system, it is possible to associate to it a graph, also known as software network, where graph nodes are the software modules (packages, files, classes or other software entities), and graph edges are the relationships between modules. A recent paper by some of the authors demonstrated that the structure of software networks is also self-similar under a length-scale trans...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001